Concurrent Constraint Programming and Non-commutative Logic

Concurrent Constraint Programming and Non-Commutative Linear Logic (Extended Abstract)

Phase Semantics and Veri cation of Concurrent Constraint

The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic linear logic for a variety of observables. In this paper we settle basic completeness results and we show how the phase semantics of linear logic can be used to provide simple and very concise \semantical" ...

Implementing a Finite Domain Constraint Solving System in KLIC

The paper presents CHUKL, a parallel nite-domain constraint solving system. The implementation is written in the concurrent logic programming language KL1, instead of C. The work challenges the assumption that committed choice concurrent logic programming languages cannot deal with don't know non-determinism. A dynamic forking scheme is designed and implemented to handle choicepoint making. The...

Non-determinism and Probabilities in Timed Concurrent Constraint Programming (Extended Version)

We set the grounds of a framework for modeling and verifying systems involving probabilities, time, and partial information as constraints. A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed as description language. An operational semantics ensures consistent interactions between both kinds of choices. The semantics is also shown to be in...

Concurrent Logic / Constraint Programming : The Next 10 Years

Concurrent logic/constraint programming is a simple and elegant formalism of concurrency that can potentially address a lot of important future applications including parallel, distributed, and intelligent systems. Its basic concept has been extremely stable and has allowed efficient implementations. However, its uniqueness makes this paradigm rather difficult to appreciate. Many people conside...